Quantum phase recognition using quantum tensor networks
نویسندگان
چکیده
Machine learning (ML) has recently facilitated many advances in solving problems related to many-body physical systems. Given the intrinsic quantum nature of these problems, it is natural speculate that quantum-enhanced machine will enable us unveil even greater details than we currently have. With this motivation, paper examines a approach based on shallow variational ansatz inspired by tensor networks for supervised tasks. In particular, first look at standard image classification tasks using Fashion-MNIST dataset and study effect repeating network layers ansatz’s expressibility performance. Finally, use strategy tackle problem phase recognition transverse-field Ising Heisenberg spin models one two dimensions, where were able reach $$\ge 98\%$$ test-set accuracies with both multi-scale entanglement renormalization (MERA) tree (TTN) parametrized circuits.
منابع مشابه
Towards Quantum Machine Learning with Tensor Networks
Machine learning is a promising application of quantum computing, but challenges remain as near-term devices will have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix...
متن کاملSupervised Learning with Quantum-Inspired Tensor Networks
Tensor networks are efficient representations of high-dimensional tensors which have been very successful for physics and mathematics applications. We demonstrate how algorithms for optimizing such networks can be adapted to supervised learning tasks by using matrix product states (tensor trains) to parameterize models for classifying images. For the MNIST data set we obtain less than 1% test s...
متن کاملSimulating Quantum Computation by Contracting Tensor Networks
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with T gates whose underlying graph has treewidth d can be simulated deterministically in T O(1) exp[O(d)] time, which, in particular, is polynomial in T if d = O(logT ). Among many implications, we show efficient simulations and for log-depth circuits whose gates appl...
متن کاملTensor Networks and Quantum Error Correction
We establish several relations between quantum error correction (QEC) and tensor network (TN) methods of quantum many-body physics. We exhibit correspondences between well-known families of QEC codes and TNs, and demonstrate a formal equivalence between decoding a QEC code and contracting a TN. We build on this equivalence to propose a new family of quantum codes and decoding algorithms that ge...
متن کاملPhase transitions in quantum pattern recognition.
With the help of quantum mechanics one can formulate a model of associative memory with optimal storage capacity. This model is generalized by introducing a parameter playing the role of an effective temperature. The corresponding thermodynamics provides criteria to tune the efficiency of quantum pattern recognition. It is shown that the associative memory undergoes a phase transition from a di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Physical Journal Plus
سال: 2022
ISSN: ['2190-5444']
DOI: https://doi.org/10.1140/epjp/s13360-022-03587-6